Tractable Learning for Complex Probability Queries
نویسندگان
چکیده
Tractable learning aims to learn probabilistic models where inference is guaranteed to be efficient. However, the particular class of queries that is tractable depends on the model and underlying representation. Usually this class is MPE or conditional probabilities Pr(x|y) for joint assignments x,y. We propose a tractable learner that guarantees efficient inference for a broader class of queries. It simultaneously learns a Markov network and its tractable circuit representation, in order to guarantee and measure tractability. Our approach differs from earlier work by using Sentential Decision Diagrams (SDD) as the tractable language instead of Arithmetic Circuits (AC). SDDs have desirable properties, which more general representations such as ACs lack, that enable basic primitives for Boolean circuit compilation. This allows us to support a broader class of complex probability queries, including counting, threshold, and parity, in polytime.
منابع مشابه
Tractable Learning for Structured Probability Spaces: A Case Study in Learning Preference Distributions
Probabilistic sentential decision diagrams (PSDDs) are a tractable representation of structured probability spaces, which are characterized by complex logical constraints on what constitutes a possible world. We develop general-purpose techniques for probabilistic reasoning and learning with PSDDs, allowing one to compute the probabilities of arbitrary logical formulas and to learn PSDDs from i...
متن کاملLearning Markov Networks With Arithmetic Circuits
Markov networks are an effective way to represent complex probability distributions. However, learning their structure and parameters or using them to answer queries is typically intractable. One approach to making learning and inference tractable is to use approximations, such as pseudo-likelihood or approximate inference. An alternate approach is to use a restricted class of models where exac...
متن کاملThesis Proposal Algorithms for Answering Queries with Graphical Models
In numerous real world applications, from sensor networks to patient monitoring to intelligent buildings, probabilistic inference is necessary to make conclusions about the system in question in the face of uncertainty. The key problem in all those settings is to compute the probability distribution over some random variables of interest (the query) given the known values of other random variab...
متن کاملTowards Compact Interpretable Models: Shrinking of Learned Probabilistic Sentential Decision Diagrams
Probabilistic sentential decision diagrams (PSDDs) were recently introduced as a tractable and interpretable representation of discrete probability distributions. PSDDs are tractable because they support a wide range of queries efficiently. They are interpretable because each parameter in the PSDD represents a conditional probability, as in Bayesian networks. This paper summarizes ongoing resea...
متن کاملTowards Representation Learning with Tractable Probabilistic Models
Probabilistic models learned as density estimators can be exploited in representation learning beside being toolboxes used to answer inference queries only. However, how to extract useful representations highly depends on the particular model involved. We argue that tractable inference, i.e. inference that can be computed in polynomial time, can enable general schemes to extract features from b...
متن کامل